A Construction of Cartesian Authentication Code from Orthogonal Spaces over a Finite Field of odd Characteristic
نویسندگان
چکیده
In this paper, we construct a Cartesian authentication code from subspaces of orthogonal space F (2ν+1) q of odd characteristic and compute its parameters. Assuming that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of successful impersonation attack and substitution attack are also computed.
منابع مشابه
The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
In this paper, we construct a d-disjunct matrix with the orthogonal spaces over finite fields of odd characteristic. We consider the arrangement problem of d (m−1,2(s−1), s−1)-subspaces and the tighter bounds for an error-tolerant pooling design. Moreover, we give the tighter analysis of our construction by the results of the arrangement problem. Additionally, by comparing our construction with...
متن کاملA New Construction of Multi-sender Authentication Codes from Polynomials over Finite Fields
Multisender authentication code was firstly constructed by Gilbert et al. [1] in 1974. Multisender authentication system refers towho a groupof senders, cooperatively send amessage to a receiver; then the receiver should be able to ascertain that the message is authentic. About this case, many scholars and researchers had made great contributions to multisender authentication codes, such as [2–...
متن کاملA Construction of Multi-sender Authentication Codes from Pseudo-Symplectic Geometry over Finite Fields
Multisender authentication code was firstly constructed by Gilbert et al. in [1] in 1974.Multisender authentication system refers to a group of senders that cooperatively send amessage to the receiver, and then the receiver should be able to ascertain that the message is authentic. About this case, many scholars had also much researches and had made great contributions to multisender authentica...
متن کاملIsotropy of Orthogonal Involutions
An orthogonal involution on a central simple algebra becoming isotropic over any splitting field of the algebra, becomes isotropic over a finite odd degree extension of the base field (provided that the characteristic of the base field is not 2). Our aim is a proof of the following result, generalizing the hyperbolicity statement of [5]: Theorem 1. Let F be a field of characteristic not 2, A a ...
متن کاملAuthentication codes based on resilient Boolean maps
We introduce new constructions of systematic authentication codes over finite fields and Galois rings. One code is built over finite fields using resilient functions and it provides optimal impersonation and substitution probabilities. Other two proposed codes are defined over Galois rings, one is based on resilient maps and it attains optimal probabilities as well, while the other uses maps wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Math., Alg. and Appl.
دوره 1 شماره
صفحات -
تاریخ انتشار 2009